The total path length of split trees
نویسندگان
چکیده
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efficiency of the algorithm/data structure. Using renewal theory, we prove convergence in distribution of the total path length towards a distribution characterized uniquely by a fixed point equation. Our result covers, using a unified approach, many data structures such as binary search trees, m-ary search trees, quad trees, median-of-(2k + 1) trees, and simplex trees.
منابع مشابه
Fringe Analysis of 2-3 Trees with Lazy Parent Split Fringe Analysis of 2-3 Trees with Lazy Parent Split
In B-trees with Lazy Parent Split (LPS) parent splits are postponed until a future access of the latter node. This way, the number of splits during an insert is decreased and the number of locks is also decreased. Consequently, better concurrency is achieved. In this paper we study 2-3 trees with LPS. We use fringe analysis to obtain bounds on some performance measures of 2-3 trees with LPS. Th...
متن کاملGenetic variability and relationship of pod and seed traits in Pongamia Pinnata (L.) Pierre., a potential agroforestry tree
Screening of twenty-four candidate plus trees from naturally available Pongamia pinnata genetic resources was carried out to elucidate the genetic variation and relationship of pod and seed traits on germination capacity to select the best planting material for higher productivity. The experiment conducted at Forest Research Centre, Institute of Forest Productivity Mandar, Ranchi during 2005-20...
متن کاملOn the internal path length of d-dimensional quad trees
It is proved that the internal path length of a d–dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments of the limiting distribution can be evaluated from the recursion and lead to first order asymptotics for the ...
متن کاملThe k-th Total Path Length and the Total Steiner k-Distance for Digital Search Trees
The total Steiner k-distance and the k-th total path length are the sum of the size of Steiner trees and ancestor-trees over sets of k nodes of a given tree, respectively. They are useful statistics with many applications. Consequently, they have been analyzed for many different random trees, including increasing tree, binary search tree, generalized m-ary search tree and simply generated trees...
متن کاملAsymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1102.2541 شماره
صفحات -
تاریخ انتشار 2011